| 翻訳と辞書 |
| linked data structure ： ウィキペディア英語版 |
linked data structure
In computer science, a linked data structure is a data structure which consists of a set of data records (''nodes'') linked together and organized by references (''links'' or ''pointers''). The link between data can also be called a connector.
In linked data structures, the links are usually treated as special data types that can only be dereferenced or compared for equality. Linked data structures are thus contrasted with arrays and other data structures that require performing arithmetic operations on pointers. This distinction holds even when the nodes are actually implemented as elements of a single array, and the references are actually array indices: as long as no arithmetic is done on those indices, the data structure is essentially a linked one.
Linking can be done in two ways - Using dynamic allocation and using array index linking.
Linked data structures include linked lists, search trees, expression trees, and many other widely used data structures. They are also key building blocks for many efficient algorithms, such as topological sort〔Donald Knuth, The Art of Computer Programming〕 and set union-find.〔Bernard A. Galler and Michael J. Fischer. An improved equivalence algorithm. ''Communications of the ACM,'' Volume 7, Issue 5 (May 1964), pages 301-303. The paper originating disjoint-set forests. (ACM Digital Library )〕
==Common types of linked data structures==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「linked data structure」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|